Diclib.com
Dictionnaire ChatGPT

Recherche dans le dictionnaire Solutions personnalisées

Entrez un mot ou une phrase dans n'importe quelle langue 👆

Langue:

Traduction et analyse de mots par intelligence artificielle ChatGPT

Sur cette page, vous pouvez obtenir une analyse détaillée d'un mot ou d'une phrase, réalisée à l'aide de la meilleure technologie d'intelligence artificielle à ce jour:

comment le mot est utilisé
fréquence d'utilisation
il est utilisé plus souvent dans le discours oral ou écrit
options de traduction de mots
exemples d'utilisation (plusieurs phrases avec traduction)
étymologie

fundamental subsequence - traduction vers russe

ALGORITHM TO FIND THE LONGEST INCREASING SUBSEQUENCE IN AN ARRAY OF NUMBERS

Longest increasing subsequence problem; Nondecreasing subsequence; Longest nondecreasing subsequence

fundamental subsequence

математика

фундаментальная подпоследовательность

subsequence

BINARY RELATION BETWEEN SEQUENCES (STRINGS)

Sub-sequence; Subsequency; Subsequences; Common subsequence

сущ.

1) последующее событие;

2) последствие.

subsequences

BINARY RELATION BETWEEN SEQUENCES (STRINGS)

Sub-sequence; Subsequency; Subsequences; Common subsequence

общая лексика

градация (категорий приоритета)

Définition

fundamental

I. a.

Essential, primary, indispensable, radical, constitutional, organic, most important, principal.

II. n.

Leading principle, essential part, essential principle.

Afficher plus de définitions

Wikipédia

Longest increasing subsequence

In computer science, the longest increasing subsequence problem is to find a subsequence of a given sequence in which the subsequence's elements are in sorted order, lowest to highest, and in which the subsequence is as long as possible. This subsequence is not necessarily contiguous, or unique. Longest increasing subsequences are studied in the context of various disciplines related to mathematics, including algorithmics, random matrix theory, representation theory, and physics. The longest increasing subsequence problem is solvable in time $O(n\log n),$ where $n$ denotes the length of the input sequence.

https://en.wikipedia.org/wiki/Longest increasing subsequence

Traduction de &#39fundamental subsequence&#39 en Russe